Contraction ratios for graph-directed iterated constructions
نویسندگان
چکیده
منابع مشابه
Contraction Ratios for Graph-directed Iterated Constructions
We provide necessary and sufficient conditions for a graph-directed iterated function system to be strictly contracting.
متن کاملDirected prime graph of non-commutative ring
Prime graph of a ring R is a graph whose vertex set is the whole set R any any two elements $x$ and $y$ of $R$ are adjacent in the graph if and only if $xRy = 0$ or $yRx = 0$. Prime graph of a ring is denoted by $PG(R)$. Directed prime graphs for non-commutative rings and connectivity in the graph are studied in the present paper. The diameter and girth of this graph are also studied in the pa...
متن کاملA Fractal Dimension Estimate for a Graph-directed Iterated Function System of Non-similarities
Suppose a graph-directed iterated function system consists of maps fe with upper estimates of the form d ( fe(x),fe(y) ) ≤ red(x,y). Then the fractal dimension of the attractor Kv of the IFS is bounded above by the dimension associated to the Mauldin–Williams graph with ratios re. Suppose the maps fe also have lower estimates of the form d ( fe(x),fe(y) ) ≥ r′ ed(x,y) and that the IFS also sati...
متن کاملAn analogue of Cobham's theorem for graph directed iterated function systems
Feng and Wang showed that two homogeneous iterated function systems in R with multiplicatively independent contraction ratios necessarily have different attractors. In this paper, we extend this result to graph directed iterated function systems in R with contraction ratios that are of the form 1 β , for integers β. By using a result of Boigelot et al., this allows us to give a proof of a conje...
متن کاملOptimal Graph Search with Iterated Graph Cuts
Informed search algorithms such as A* use heuristics to focus exploration on states with low total path cost. To the extent that heuristics underestimate forward costs, a wider cost radius of suboptimal states will be explored. For many weighted graphs, however, a small distance in terms of cost may encompass a large fraction of the unweighted graph. We present a new informed search algorithm, ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the American Mathematical Society
سال: 2005
ISSN: 0002-9939
DOI: 10.1090/s0002-9939-05-08146-3